The X-Code with Non-Prime Size Codewords
نویسندگان
چکیده
In this correspondence, we present a new description of the X-Code, a class of MDS array code, using skews. The X-Codes result in codewords that are arrays of size n × n, where n is prime. Our new description does not require n to be prime but requires n to be an odd number with smallest prime factor greater than 3. We prove that our description results in a distance-3 MDS code and also show which slopes other than 1 and –1 can be used to construct X-Codes.
منابع مشابه
BLIND PARAMETER ESTIMATION OF A RATE k/n CONVOLUTIONAL CODE IN NOISELESS CASE
This paper concerns to blind identification of a convolutional code with desired rate in a noiseless transmission scenario. To the best of our knowledge, blind estimation of convolutional code based on only the received bitstream doesn’t lead to a unique solution. Hence, without loss of generality, we will assume that the transmitter employs a non-catastrophic encoder. Moreover, we consider a c...
متن کاملSmall weight codewords in the codes arising from Desarguesian projective planes
We study codewords of small weight in the codes arising from Desarguesian projective planes. We first of all improve the results of K. Chouinard on codewords of small weight in the codes arising from PG(2, p), p prime. Chouinard characterized all the codewords up to weight 2p in these codes. Using a particular basis for this code, described by Moorhouse, we characterize all the codewords of wei...
متن کاملNew infinite families of 3-designs from preparata codes over Z4
We consider t-designs constructed from codewords in the Preparata code ~ ove r 2~4. A new approach is given to prove that the support (size 5) of minimum Lee weight codewords form a simple 3-design for any odd integer m >t 3. We also show that the support of codewords with support size 6 form four new families of simple 3-designs, with parameters (2",6,2" 8 ) , (2",6,5 (2 m-I 4)), (2m,6,20 • (2...
متن کاملAn empty interval in the spectrum of small weight codewords in the code from points and k-spaces of PG(n, q)
Let Ck(n, q) be the p-ary linear code defined by the incidence matrix of points and k-spaces in PG(n, q), q = p, p prime, h ≥ 1. In this paper, we show that there are no codewords of weight in the open interval ] q −1 q−1 , 2q[ in Ck(n, q) \ Cn−k(n, q) ⊥ which implies that there are no codewords with this weight in Ck(n, q) \ Ck(n, q) ⊥ if k ≥ n/2. In particular, for the code Cn−1(n, q) of poin...
متن کاملMultiple blocking sets in finite projective spaces and improvements to the Griesmer bound for linear codes
In this article we shall prove that, for q = p prime and roughly 3 8 -th’s of the values of d < q k−1, there is no linear code meeting the Griesmer bound. This result uses Blokhuis’ theorem on the size of a t-fold blocking set in PG(2, p), p prime, which we generalise to higher dimensions. We also give more general lower bounds on the size of a t-fold blocking set in PG(δ, q), for arbitrary q a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004